Note on Laguerre Transform in two Variables
نویسندگان
چکیده
منابع مشابه
A Note on Summabilityof Multiple Laguerre
A simple structure of the multiple Laguerre polynomial expansions is used to study the Cess aro summability above the critical index for the convolution type Laguerre expansions. The multiple Laguerre polynomial expansion of an`1-radial function f 0 (jxj) is shown to be an`1-radial function that coincides with the Laguerre polynomial expansion of f 0 , which allows us to settle the problem of s...
متن کاملA note on k [ z ] - automorphisms in two variables
We prove that for a polynomial f ∈ k[x, y, z] equivalent are: (1)f is a k[z]-coordinate of k[z][x, y], and (2) k[x, y, z]/(f) ∼= k[2] and f(x, y, a) is a coordinate in k[x, y] for some a ∈ k. This solves a special case of the Abhyankar-Sathaye conjecture. As a consequence we see that a coordinate f ∈ k[x, y, z] which is also a k(z)-coordinate, is a k[z]-coordinate. We discuss a method for const...
متن کاملNote on Certain Inequalities for Means in Two Variables
Given the positive real numbers x and y, let A(x, y), G(x, y), and I(x, y) denote their arithmetic mean, geometric mean, and identric mean, respectively. It is proved that for p ≥ 2, the double inequality αA(x, y) + (1− α)G(x, y) < I(x, y) < βA(x, y) + (1− β)G(x, y) holds true for all positive real numbers x 6= y if and only if α ≤ ( 2 e )p and β ≥ 23 . This result complements a similar one est...
متن کاملA Note on Simple Programs with Two Variables
It is well known that programs using only the following constructs: {x+x+ 1, X+-.X I 1, if x =0 then goto I, goto 1, halt} compute all partial recursive functions [7]. In fact, Minsky showed that simple programs with three variables compute all partial recursive functions with one argument and, consequently, simple programs with three variables recognize all recursively enumerable sets. We ask ...
متن کاملA Fast Laplace Transform Based on Laguerre Functions
In this paper, we present a fast algorithm which evaluates a discrete Laplace transform with N points at M arbitrarily distributed points in C(N + M) work, where C depends only on the precision required. Our algorithm breaks even with the direct calculation at N = M = 20, and achieves a speedup of 1000 with 10000 points. It is based on a geometric divide and conquer strategy, combined with the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Pure Mathematics
سال: 2011
ISSN: 2160-0368,2160-0384
DOI: 10.4236/apm.2011.14035